Robust Constrained CMA Based on a Bayesian Approach under Quadratic Constraint
نویسندگان
چکیده
CMA has been known as blind adaptive beamforming because it requires no knowledge about the signal except that the transmitted signal waveform has a constant envelope. But in practical applications, the constrained CMA degrades in the presence of both signal steering vector errors and interference nonstationarity. In this paper, we propose robust constrained CMA based on a Bayesian approach under the quadratic constraint, which improves the output performance in nonideal situations. The quadratic constraint on the weight can provide excellent robustness to signal steering vector mismatches and to random perturbations in sensor parameters. It is found that robust constrained CMA under quadratic constraint can reduce successfully the output power of internal noise while cancelling the interference enough. The Lagrange multipliers are updated and added at each step. The proposed algorithm offers faster rate, has better interference suppression, and yields higher SINR and better signal capture performance than the constrained CMA. Via computer simulation, it is show that the proposed algorithm achieves a substantially improved performance.
منابع مشابه
3D BENCHMARK RESULTS FOR ROBUST STRUCTURAL OPTIMIZATION UNDER UNCERTAINTY IN LOADING DIRECTIONS
This study has been inspired by the paper "An efficient 3D topology optimization code written in MATLAB” written by Liu and Tovar (2014) demonstrating that SIMP-based three-dimensional (3D) topology optimization of continuum structures can be implemented in 169 lines of MATLAB code. Based on the above paper, we show here that, by simple and easy-to-understand modificati...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JNW
دوره 5 شماره
صفحات -
تاریخ انتشار 2010